By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Matrix Analysis and Applications

Table of Contents
Volume 13, Issue 1, pp. vii-417

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Dedication to Gene H. Golub on the Occasion of his 15th Birthday

Cleve Moler

pp. vii-viii

Constrained Matrix Sylvester Equations

Jewel B. Barlow, Moghen M. Monahemi, and Dianne P. O'Leary

pp. 1-9

The Componentwise Distance to the Nearest Singular Matrix

James Demmel

pp. 10-19

On the Significance of Nongeneric Total Least Squares Problems

Sabine Van Huffel

pp. 20-35

Sign-Nonsingular Matrix Pairs

Richard A. Brualdi and Keith L. Chavey

pp. 36-40

On the Sum of the Largest Eigenvalues of a Symmetric Matrix

Michael L. Overton and Robert S. Womersley

pp. 41-45

Regularization of Descriptor Systems by Derivative and Proportional State Feedback

Angelika Bunse-Gerstner, Volker Mehrmann, and Nancy K. Nichols

pp. 46-67

Separable Nonlinear Least Squares with Multiple Right-Hand Sides

Linda Kaufman and Garrett Sylvester

pp. 68-89

Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with $\operatorname{sep}^{ - 1} $ Estimators

Bo Kågström and Peter Poromaa

pp. 90-101

Best Cyclic Repartitioning for Optimal Successive Overrelaxation Convergence

Sofoklis Galanis and Apostolos Hadjidimos

pp. 102-120

Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations

A. Greenbaum and Z. Strakos

pp. 121-137

Stopping Criteria for Iterative Solvers

Mario Arioli, Iain Duff, and Daniel Ruiz

pp. 138-144

Numerical Considerations in Computing Invariant Subspaces

Jack J. Dongarra, Sven Hammarling, and James H. Wilkinson

pp. 145-161

Backward Error and Condition of Structured Linear Systems

Desmond J. Higham and Nicholas J. Higham

pp. 162-175

Loss and Recapture of Orthogonality in the Modified Gram–Schmidt Algorithm

Å. Björck and C. C. Paige

pp. 176-190

A Block-$LU$ Update for Large-Scale Linear Programming

Samuel K. Eldersveld and Michael A. Saunders

pp. 191-201

Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization

Stanley C. Eisenstat and Joseph W. H. Liu

pp. 202-211

The Interface Probing Technique in Domain Decomposition

Tony F. C. Chan and Tarek P. Mathew

pp. 212-238

Refined Interlacing Properties

R. O. Hill, Jr. and B. N. Parlett

pp. 239-247

A Parallel Iteration Method and the Convection-Diffusion Equation

John de Pillis

pp. 248-273

Fast Adaptive Condition Estimation

Daniel J. Pierce and Robert J. Plemmons

pp. 274-291

Preconditioners for Indefinite Systems Arising in Optimization

Philip E. Gill, Walter Murray, Dulce B. Ponceleón, and Michael A. Saunders

pp. 292-311

Algorithmic Fault Tolerance Using the Lanczos Method

Daniel L. Boley, Richard P. Brent, Gene H. Golub, and Franklin T. Luk

pp. 312-332

Sparse Matrices in MATLAB: Design and Implementation

John R. Gilbert, Cleve Moler, and Robert Schreiber

pp. 333-356

Implicit Application of Polynomial Filters in a $k$-Step Arnoldi Method

D. C. Sorensen

pp. 357-385

Efficient Matrix Multiplication on SIMD Computers

P. Bjørstad, F. Manne, T. Sørevik, and M. Vajtersic

pp. 386-401

Gauss Quadratures: An Inverse Problem

Jaroslav Kautsky

pp. 402-417